A system for proper multiple-conclusion entailment
نویسندگان
چکیده
منابع مشابه
A System for Proper Multiple-conclusion Entailment
The concept of proper multiple-conclusion entailment is introduced. For any sets X, Y of formulas, we say that Y is properly mc-entailed by X iff Y is mc-entailed by X, but no A ∈ Y is single-conclusion entailed by X. The concept has a natural interpretation in terms of question evocation. A sound and complete axiom system for the propositional case of proper mc-entailment is presented.
متن کاملA Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [12], provide for various forms of abstraction (modules, abstract data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] pr...
متن کاملMultiple Agent Based Entailment System(MABES) for RTE
Despite growing needs of the legal artificial intelligence (AI), its development is slower than other AI domains because legal expertise is essentially required to develop legal AI systems. Legal knowledge representation on legal expertise needs to be considered to implement legal reasoning AI systems. In this paper, we present a legal reasoning methodology, which utilizes multiple expert knowl...
متن کاملForum: a Multiple-conclusion Speciication Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic reenement, Lolli 15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) 2] pr...
متن کاملForum: A Multiple-Conclusion Specification Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2015
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.2015.001